A Jacobi–Davidson type method for the product eigenvalue problem
نویسندگان
چکیده
منابع مشابه
A Jacobi–Davidson type method for the product eigenvalue problem
We propose a Jacobi–Davidson type technique to compute selected eigenpairs of the product eigenvalue problem Am · · ·A1x = λx, where the matrices may be large and sparse. To avoid difficulties caused by a high condition number of the product matrix, we split up the action of the product matrix and work with several search spaces. We generalize the Jacobi–Davidson correction equation, and the ha...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Cascadic Multigrid Method for Eigenvalue Problem
A cascadic multigrid method is proposed for eigenvalue problems based on the multilevel correction scheme. With this new scheme, an eigenvalue problem on the finest space can be solved by linear smoothing steps on a series of multilevel finite element spaces and nonlinear correcting steps on special coarsest spaces. Once the sequence of finite element spaces and the number of smoothing steps ar...
متن کاملA Spectral Method for the Eigenvalue Problem for Elliptic Equations
Let Ω be an open, simply connected, and bounded region in R, d ≥ 2, and assume its boundary ∂Ω is smooth. Consider solving the eigenvalue problem Lu = λu for an elliptic partial differential operator L over Ω with zero values for either Dirichlet or Neumann boundary conditions. We propose, analyze, and illustrate a ‘spectral method’ for solving numerically such an eigenvalue problem. This is an...
متن کاملOn a Newton Method for the Inverse Toeplitz Eigenvalue Problem
Iterative methods for inverse eigenvalue problems involve simultaneous approximation of the matrix being sought and its eigenvectors This paper revisits one such method for the inverse Toeplitz eigenvalue problems by exploring the eigenstructure of centrosymmetric matrices All itera tions are now taking place on a much smaller subspace One immediate consequence is that the size of the problem i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2008
ISSN: 0377-0427
DOI: 10.1016/j.cam.2006.11.020